Ranking the vertices of an r-partite paired comparison digraph
نویسنده
چکیده
A paired comparison digraph D is a weighted digraph in which the sum of the weights of arcs, if any, joining two vertices exactly one. A one-to-one mapping from V (D) onto {1, 2, . . . , |V (D)|} is called a ranking ofD, and a ranking α ofD is optimal if the backward length of α is minimum. We say that D is r-partite if V (D) can be partitioned into V1 ∪ · · · ∪ Vr so that every arc of D joining a vertex of Vi to a vertex of Vj , where i 6= j. We show that we can easily obtain all the optimal ranking of a certain r-partite paired comparison digraph.
منابع مشابه
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
A digraph obtained by replacing each edge of a complete n-partite (n 2:: 2) graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a semicomplete n-partite digraph or semicomplete multipartite digraph (abbreviated to SMD). In this paper we show the following result for a semicomplete multipartite digraph of order p with the partite sets VI, 112, ... , Vn. Let r...
متن کاملCycles through a given Set of Vertices in Regular Multipartite Tournaments
A tournament is an orientation of a complete graph, and in general a multipartite or c-partite tournament is an orientation of a complete c-partite graph. In a recent article, the authors proved that a regular c-partite tournament with r ≥ 2 vertices in each partite set contains a cycle with exactly r− 1 vertices from each partite set, with exception of the case that c = 4 and r = 2. Here we wi...
متن کاملRanking the Vertices of a Complete Multipartite Paired Comparison Digraph
A paired comparison digraph (abbreviated to PCD)D = (V,A) is a weighted digraph in which the sum of the weights of arcs, if any, joining two distinct vertices equals one. A one-to-one mapping α from V onto {1, 2, ..., |V |} is called a ranking ofD. For every ranking α, an arc vu ∈ A is said to be forward if α(v) < α(u), and backward, otherwise. The length of an arc vu is `(vu) = (vw)|α(v)− α(u)...
متن کاملThe ratio of the longest cycle and longest path in semicomplete multipartite digraphs
A digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair of mutually opposite arcs is called a semicomplete n-partite digraph. We call (D)=max16 i6 n{|Vi|} the independence number of the semicomplete n-partite digraph D, where V1; V2; : : : ; Vn are the partite sets of D. Let p and c, respectively, denote the number of vertices in a longest directed path and t...
متن کاملk-kernels in multipartite tournaments
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k, l)-kernel N of D is a k-independent set of vertices (if u, v ∈ N then d(u, v), d(v, u) ≥ k) and l-absorbent (if u ∈ V (D) − N then there exists v ∈ N such that d(u, v) ≤ l). A k-kernel is a (k, k − 1)-kernel. An m-partite tournament is an orientation of an m-partite complete graph. In this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 17 شماره
صفحات -
تاریخ انتشار 1987